//
// Created by Administrator on 2023/11/12.
//
#include <iostream>

using namespace std;

int partition(int A[],int low,int high){
    int pivot=A[low];
5
    while(low<high){
        while(low<high&&A[high]>=pivot) high--;
        A[low]=A[high];
        while(low<high&&A[low]<=pivot) low++;
        A[high]=A[low];
    }
    A[low]=pivot;
    return low;
}

void quick_sort(int A[],int low,int high){
    if(low>=high) return;
    int pivotPos= partition(A,low,high);
    quick_sort(A,low,pivotPos-1);
    quick_sort(A,pivotPos+1,high);
}

int main(){
    int n;
    cin>>n;
    int A[n];
    for (int i = 0; i < n; ++i) {
        cin>>A[i];
    }
    quick_sort(A,0,n);
    for (int i = 0; i < n; ++i) {
        cout<<A[i];
    }


}